A proof by graphical construction of the no-pumping theorem of stochastic pumps
نویسندگان
چکیده
A stochastic pump is a Markov model of a mesoscopic system evolving under the control of externally varied parameters. In the model, the system makes random transitions among a network of states. For such models, a “no-pumping theorem” has been obtained, which identifies minimal conditions for generating directed motion or currents. We provide a derivation of this result using a simple graphical construction on the network of states.
منابع مشابه
Directed flow in nonadiabatic stochastic pumps.
We analyze the operation of a molecular machine driven by the nonadiabatic variation of external parameters. We derive a formula for the integrated flow from one configuration to another, obtain a "no-pumping theorem" for cyclic processes with thermally activated transitions, and show that in the adiabatic limit the pumped current is given by a geometric expression.
متن کاملThe Basic Theorem and its Consequences
Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...
متن کاملA new proof for the Banach-Zarecki theorem: A light on integrability and continuity
To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...
متن کاملAnalogy Makes Proofs
Many mathematical proofs are hard to generate for humans and even harder for automated theorem provers. Classical techniques of automated theorem proving involve the application of basic rules, of built-in special procedures, or of tactics. Melis (Melis 1993) introduced a new method for analogical reasoning in automated theorem proving. In this paper we show how the derivational analogy replay ...
متن کاملAnalogy Makes Proofs Feasible
Many mathematical proofs are hard to generate for humans and even harder for automated theorem provers. Classical techniques of automated theorem proving involve the application of basic rules, of built-in special procedures, or of tactics. Melis (Melis 1993) introduced a new method for analogical reasoning in automated theorem proving. In this paper we show how the derivational analogy replay ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013